The rank of connection matrices and the dimension of graph algebras
نویسنده
چکیده
Connection matrices were introduced in [1], where they were used to characterize graph homomorphism functions. The goal of this note is to determine the exact rank of these matrices. The result can be rephrased in terms of graph algebras, also introduced in [1]. Yet another version proves that if two k-tuples of nodes behave the same way from the point of view of graph homomorphisms, then they are equivalent under the automorphism group.
منابع مشابه
NILPOTENT GRAPHS OF MATRIX ALGEBRAS
Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...
متن کاملFiniteness Conditions for Graph Algebras over Tropical Semirings
Connection matrices for graph parameters with values in a field have been introduced by M. Freedman, L. Lovász and A. Schrijver (2007). Graph parameters with connection matrices of finite rank can be computed in polynomial time on graph classes of bounded tree-width. We introduce join matrices, a generalization of connection matrices, and allow graph parameters to take values in the tropical ri...
متن کاملThe rank of edge connection matrices and the dimension of algebras of invariant tensors
We characterize the rank of edge connection matrices of partition functions of real vertex models, as the dimension of the homogeneous components of the algebra of G-invariant tensors. Here G is the subgroup of the real orthogonal group that stabilizes the vertex model. This answers a question of Balázs Szegedy from 2007.
متن کاملReal Rank and Topological Dimension of Higher Rank Graph Algebras
We study dimension theory for the C∗-algebras of row-finite k-graphs with no sources. We establish that strong aperiodicity—the higher-rank analogue of condition (K)—for a k-graph is necessary and sufficient for the associated C∗-algebra to have topological dimension zero. We prove that a purely infinite 2-graph algebra has real-rank zero if and only if it has topological dimension zero and sat...
متن کاملOn p-semilinear transformations
In this paper, we introduce $p$-semilinear transformations for linear algebras over a field ${bf F}$ of positive characteristic $p$, discuss initially the elementary properties of $p$-semilinear transformations, make use of it to give some characterizations of linear algebras over a field ${bf F}$ of positive characteristic $p$. Moreover, we find a one-to-one correspondence between $p$-semiline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 27 شماره
صفحات -
تاریخ انتشار 2006